On the existence of a small connected open set with a connected boundary
نویسندگان
چکیده
منابع مشابه
On the Existence of a Small Connected Open Set with a Connected Boundary
In a connected, locally connected, locally compact metric space with no local separating point it is rather easy to construct an arbitrarily small connected open set whose boundary is a subset of an arbitrary small continuum lying in its complement. In fact such sets form a topological basis for the space. However, it seems to be much more difficult to construct small connected open sets whose ...
متن کاملOn the existence of a connected component of a graph
We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to ACA0 over RCA0. The problem of decomposing a countable graph into connected components is strongly Weihrauch equivalent to the problem of finding a single component, and each is equivalent to its infini...
متن کاملA note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are now consistent with the existing results on connected dominating set problem which is a special case of the minimum connected set cover problem.
متن کاملthe effect of consciousness raising (c-r) on the reduction of translational errors: a case study
در دوره های آموزش ترجمه استادان بیشتر سعی دارند دانشجویان را با انواع متون آشنا سازند، درحالی که کمتر به خطاهای مکرر آنان در متن ترجمه شده می پردازند. اهمیت تحقیق حاضر مبنی بر ارتکاب مکرر خطاهای ترجمانی حتی بعد از گذراندن دوره های تخصصی ترجمه از سوی دانشجویان است. هدف از آن تاکید بر خطاهای رایج میان دانشجویان مترجمی و کاهش این خطاها با افزایش آگاهی و هوشیاری دانشجویان از بروز آنها است.از آنجا ک...
15 صفحه اولOn connected dominating set games †
Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1962
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1962-10748-4